Pin Balancing in Ratio Cut Partitioning
نویسنده
چکیده
Partitioning is a fundamental step in the computer-aided design process. One of the best algorithms for partitioning is ratio cut 10] but, as many others, it does not take into account speciic properties of multi-terminal nets, especially with regard to module pin count. In this paper, we show that the number of pins per module can be unbalanced if not taken care of properly. Since this unbalance can have important implications, we present a way to improve the pin balance without losing the best partitioning qualities.
منابع مشابه
Pin Count Prediction in Ratio Cut Partitioning for Vlsi and Ulsi
Partitioning is an important step in computer-aided design. The ‘ratio cut’ bipartitioning algorithm [1] is known to be one of the best partitioning algorithms. It partitions a circuit into two (disjoint) modules by cutting some of its nets. Based on theoretical arguments, the cost function that is minimized for finding the best partitioning structure in the circuit is set to be the ratio of th...
متن کاملPIN count prediction in ratio cut partitioning for VLSI and ULSI
Partitioning is an important step in computer-aided design. The ‘ratio cut’ bipartitioning algorithm [1] is known to be one of the best partitioning algorithms. It partitions a circuit into two (disjoint) modules by cutting some of its nets. Based on theoretical arguments, the cost function that is minimized for finding the best partitioning structure in the circuit is set to be the ratio of th...
متن کاملShape-optimized mesh partitioning and load balancing for parallel adaptive FEM
We present a dynamic distributed load balancing algorithm for parallel, adaptive Finite Element simulations in which we use preconditioned Conjugate Gradient solvers based on domain-decomposition. The load balancing is designed to maintain good partition aspect ratio and we show that cut size is not always the appropriate measure in load balancing. Furthermore, we attempt to answer the question...
متن کامل(Re)partitioning for stream-enabled computation
Partitioning an input graph over a set of workers is a complex operation. Objectives are twofold: split the work evenly, so that every worker gets an equal share, and minimize edge cut to achieve a good work locality (i.e. workers can work independently). Partitioning a graph accessible from memory is a notorious NP-complete problem. Motivated by the regain of interest for the stream processing...
متن کاملScalable Partitioning Algorithms for FPGAs with Heterogeneous Resources
As FPGA densities increase, partitioning-based FPGA placement approaches are becoming increasingly important as they can be used to provide high-quality and computationally scalable placement solutions. However, modern FPGA architectures incorporate heterogeneous resources, which place additional requirements on the partitioning algorithms because they now need to not only minimize the cut and ...
متن کامل